Bubble check: a simplified algorithm for elementary check node processing in extended min-sum non-binary LDPC decoders
نویسندگان
چکیده
منابع مشابه
Complexity Comparison of Non-Binary LDPC Decoders
This paper presents a detailed complexity study of the existing non-binary LDPC decoding algorithms in order to rigorously compare them from a hardware perspective. The Belief Propagation algorithm is first considered as well as its derivative versions in the frequency and logarithm domains. We then focus on the Extended Min-Sum and its recent simplified version. For each algorithm, the number ...
متن کاملHigh-throughput architecture and implementation of regular (2, dc) nonbinary LDPC decoders
Nonbinary LDPC codes have shown superior performance, but decoding nonbinary codes is complex, incurring a long latency and a much degraded throughput. We propose a low-latency variable processing node by a skimming algorithm, together with a low-latency extended min-sum check processing node by prefetching and relaxing redundancy control. The processing nodes are jointly designed for an optima...
متن کاملSimplified Trellis Min-Max Decoder Architecture for Nonbinary Low-Density Parity-Check Codes
Non-binary Low-Density Parity-Check (NB-LDPC) codes have become an efficient alternative to their binary counterparts in different scenarios such as: moderate codeword lengths, high order modulations and burst error correction. Unfortunately, the complexity of NB-LDPC decoders is still too high for practical applications, especially for the check node processing, which limits the maximum achiev...
متن کاملPerformance Analysis and Implementation for Nonbinary Quasi-cyclic Ldpc Decoder Architecture
Non-binary low-density parity check (NB-LDPC) codes are an extension of binary LDPC codes with significantly better performance. Although various kinds of low-complexity iterative decoding algorithms have been proposed, there is a big challenge for VLSI implementation of NBLDPC decoders due to its high complexity and long latency. In this brief, highly efficient check node processing scheme, wh...
متن کاملLow-Complexity Modified Trellis-Based Min-Max Non- Binary LDPC Decoders
Non-Binary Low-Density Parity-Check (NBLDPC) codes over GF(q) (q > 2) have better errorcorrecting performance than their binary counterparts when the codeword length is moderate. In this paper, modified trellis-based Minmax decoders are proposed for NB-LDPC codes. By relaxing the constraints on which messages can be included, the trellis syndrome computation is simplified without sacrificing th...
متن کامل